Hierarchical Vector Quantizers: Structure versus Performance
نویسنده
چکیده
Hierarchical Table-Lookup Vector Quantization (HVQ) is a type of structured vector quantization first described by Chang and Gray. By replacing a full search of the codebook with a recursive series of tablelookups, HVQs pay a distortion and memory requirement penalty in return for computational simplicity, and hence speed, at the encoder. Earlier work has shown that HVQs achieving the same rate fall into classes of similar SNR performance. However, a survey of the literature indicates that little is known about how to optimally allocate memory within an HVQ in order to minimize distortion. In this paper I describe the results of simulating 2744 different HVQs with the goal of gaining insight into the relationship between HVQ memory allocation and distortion performance. I define two metrics characterizing the width and height of the lookup tables comprising an HVQ and compare the SNR achieved by an HVQ to these metrics. The simulation results suggest that HVQs wherein, on average, the number of bits produced by a table equals one-half of the number of bits consumed by a table achieve the best SNR performance.
منابع مشابه
An efficient approach to lattice-based fixed-rate entropy-coded vector quantization
In the absence of channel noise, variable-length quantizers perform better than xed rate Lloyd-Max quantizers for sources with a non-uniform density function. However, channel errors can lead to a loss of synchronization resulting in a propagation of error. To avoid having variable rate, one can use a vector quantizer selected as a subset of high probability points in the Cartesian product of a...
متن کاملAn algorithm for uniform vector quantizer design
A vector quantizer maps a k-dimensional vector into one of a finite set of output vectors or “points”. Although certain lattices have been shown to have desirable properties for vector quantization applications, there are as yet no algorithms available in the quantization literature for building quantizers based on these lattices. An algorithm for designing vector quantizers based on the root l...
متن کاملA New Trellis Vector Residual Quantizer : Applications to Image
We present a new Trellis Coded Vector Residual Quan-tizer (TCVRQ) that combines trellis coding and vector residual quantization. We propose new methods for computing quantization levels and experimentally analyze the performances of our TCVRQ in the case of still image coding. Experimental comparisons show that our quantizer performs better than the standard Tree and Exhaustive Search Quantizer...
متن کاملBennett's integral for vector quantizers
This paper extends Bennett's integral from scalar to vector quantizers, giving a simple formula that expresses the rth-power distortion of a many-point vector quantizer in terms of the number of points, point density function, inertial profile and the distribution of the source. The inertial profile specifies the normalized moment of inertia of quantization cells as a function of location. The ...
متن کاملApproximating vector quantisation by transformation and scalar quantisation
Vector quantization provides better ratedistortion performance over scalar quantization even for a random vector with independent dimensions. However, the design and implementation complexity of vector quantizers is much higher than that of scalar quantizers. To reduce the complexity while achieving performance close to optimal vector quantization and better than scalar quantization, we propose...
متن کامل